package leetcode.median;

import java.util.Arrays;

/**
 * ClassName: $300_LengthOfLIS
 * Description:
 * date: 2022-01-10 22:10
 *
 * @author liyifan
 */
public class $300_LengthOfLIS {
    public int lengthOfLIS(int[] nums) {
        int[] dp = new int[nums.length];
        Arrays.fill(dp, 1);
        for (int i = 0;i < nums.length;i++) {
            for (int j = 0;j < i;j++) {
                if (nums[i] > nums[j])
                    dp[i] = Math.max(dp[i], dp[j] + 1);
            }
        }

        int res = 0;
        for (int i = 0;i < dp.length;i++) {
            res = Math.max(res, dp[i]);
        }
        return res;
    }
}
